Time-minimal tiling when rise is larger than zero
نویسندگان
چکیده
منابع مشابه
Time-minimal tiling when rise is larger than zero
Abstract. This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory machine when the rise of the tiled iteration space is larger than zero. Based on a new communication cost model, which accounts for computation and communication overlap for tiled programs, the problem is f...
متن کاملThe Minimal Number of Communication Startups when Tiling Space-Time Mapped Programs
Tiling is a well-known te hnique for sequential ompiler optimization, as well as for automati program parallelization. However, in the ontext of parallelization, tiling should not be onsidered as a stand-alone te hnique, but should be applied after a dedi ated parallelization phase, in our ase after spa e-time mapping [17℄. We show how tiling an bene t from spa e-time mapping, and we derive an ...
متن کاملIs an ant larger than a lion?
In order to examine the influence exerted by an irrelevant semantic variable in a comparative judgment task, we employed a Stroop-like paradigm. The stimuli were pairs of animal names that were different in their physical and semantic sizes (e.g., ant lion). Participants were asked to judge which of the two words was larger either in physical or in semantic size. Size congruity effect (i.e., fa...
متن کاملDISCUSSION : THE DANTZIG SELECTOR : STATISTICAL ESTIMATION WHEN p IS MUCH LARGER THAN
1. Introduction. This is a fascinating paper on an important topic: the choice of predictor variables in large-scale linear models. A previous paper in these pages attacked the same problem using the " LARS " algorithm (Efron, Hastie, Johnstone and Tibshirani [3]); actually three algorithms including the Lasso as middle case. There are tantalizing similarities between the Dantzig Selector (DS) ...
متن کاملTHE DANTZIG SELECTOR : STATISTICAL ESTIMATION WHEN p IS MUCH LARGER THAN n
In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Xβ + z, where β ∈ R is a parameter vector of interest, X is a data matrix with possibly far fewer rows than columns, n p, and the zi’s are i.i.d. N(0, σ). Is it possible to estimate β reliably based on the noisy data y? ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2002
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(02)00098-4